Group membership in semigroups

The subpower membership problem for semigroups

Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) asks whether b can be generated by a1, . . . , ak. If S is a finite group, then there is a folklore algorithm that decides this problem in time polynomial in nk. For semigroups this problem always lies in PSPACE. We show that the SMP for a full transformation semigroup on 3 o...

Work Group Membership

Research Proposal: Group Membership

Work Group Membership

Work Group Membership